Privacy-preserving similarity coefficients for binary data

نویسندگان

  • Kok-Seng Wong
  • Myung Ho Kim
چکیده

Similarity coefficients (also known as coefficients of association) are important measurement techniques used to quantify the extent to which objects resemble one another. Due to privacy concerns, the data owner might not want to participate in any similarity measurement if the original dataset will be revealed or could be derived from the final output. There are many different measurements used for numerical, structural and binary data. In this paper, we particularly consider the computation of similarity coefficients for binary data. A large number of studies related to similarity coefficients have been performed. Our objective in this paper is not to design a specific similarity coefficient. Rather, we are demonstrating how to compute similarity coefficients in a secure and privacy preserved environment. In our protocol, a client and a server jointly participate in the computation. At the end of the protocol, the client will obtain all summation variables needed for the computation while the server learns nothing. We incorporate cryptographic methods in our protocol to protect the original dataset and all other intermediate results. Note that our protocol also supports dissimilarity coefficients. © 2012 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A centralized privacy-preserving framework for online social networks

There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...

متن کامل

Efficient Privacy Preserving Protocols for Similarity Join

During the similarity join process, one or more sources may not allow sharing its data with other sources. In this case, a privacy preserving similarity join is required. We showed in our previous work [4] that using long attributes, such as paper abstracts, movie summaries, product descriptions, and user feedbacks, could improve the similarity join accuracy using supervised learning. However, ...

متن کامل

An Improved Privacy-Preserving Collaborative Filtering Recommendation Algorithm

Privacy-preserving collaborative filtering is an emerging web-adaptation tool to cope with information overload problem without jeopardizing individuals’ privacy. However, Collaborative filtering with privacy schemes commonly suffers from scalability and sparseness. Moreover, applying privacy measures causes a distortion in collected data, which in turn defects accuracy of such systems. In this...

متن کامل

L–Diversity-Based Semantic Anonymaztion for Data Publishing

Nowadays, publishing data publically is an important for many purposes especially for scientific research. Publishing this data in its raw form make it vulnerable to privacy attacks. Therefore, there is a need to apply suitable privacy preserving techniques on the published data. K-anonymity and L-diversity are well known techniques for data privacy preserving. These techniques cannot face the ...

متن کامل

Revisiting "Privacy Preserving Clustering by Data Transformation"

Preserving the privacy of individuals when data are shared for clustering is a complex problem. The challenge is how to protect the underlying data values subjected to clustering without jeopardizing the similarity between objects under analysis. In this short paper, we revisit a family of geometric data transformation methods (GDTMs) that distort numerical attributes by translations, scalings,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2013